Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
نویسندگان
چکیده
منابع مشابه
Lipschitz continuity of the solutions to team optimization problems revisited
Sufficient conditions for the existence and Lipschitz continuity of optimal strategies for static team optimization problems are studied. Revised statements and proofs of some results in “Kim K.H., Roush F.W., Team Theory. Ellis Horwood Limited Publishers, Chichester, UK, 1987” are presented. Keywords—Statistical information structure, team utility function, value of a team, Lipschitz continuity.
متن کاملSparse solutions of linear complementarity problems
This paper considers the characterization and computation of sparse solutions and leastp-norm (0 < p < 1) solutions of the linear complementarity problems LCP(q,M). We show that the number of non-zero entries of any least-p-norm solution of the LCP(q,M) is less than or equal to the rank of M for any arbitrary matrix M and any number p ∈ (0, 1), and there is p̄ ∈ (0, 1) such that all least-p-norm...
متن کاملIntegral Solutions of Linear Complementarity Problems
We characterize the class of integral square matrices M having the property that for every integral vector q the linear complementarity problem with data M; q has only integral basic solutions. These matrices, called principally unimodular matrices, are those for which every principal nonsingular submatrix is unimodular. As a consequence , we show that if M is rank-symmetric and principally uni...
متن کاملSmoothing methods for convex inequalities and linear complementarity problems
A smooth approximation p(x;) to the plus function: maxfx; 0g, is obtained by integrating the sigmoid function 1=(1 + e ?x), commonly used in neural networks. By means of this approximation, linear and convex inequalities are converted into smooth, convex unconstrained minimization problems, the solution of which approximates the solution of the original problem to a high degree of accuracy for ...
متن کاملNumerical validation of solutions of linear complementarity problems
This paper proposes a validation method for solutions of linear complementarity problems. The validation procedure consists of two sufficient conditions that can be tested on a digital computer. If the first condition is satisfied then a given multidimensional interval centered at an approximate solution of the problem is guaranteed to contain an exact solution. If the second condition is satis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 1987
ISSN: 0363-0129,1095-7138
DOI: 10.1137/0325033